An algorithm for the minimum variance point of a network

نویسندگان

  • PIERRE HANSEN
  • MAOLIN ZHENG
  • Maolin ZHENG
  • M. ZHENG
چکیده

An O (mn log n) algorithm is proposée to détermine a point of a network with m arcs and n vertices which minimizes the variance of the weighted distances to all vertices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Predicting Force in Single Point Incremental Forming by Using Artificial Neural Network

In this study, an artificial neural network was used to predict the minimum force required to single point incremental forming (SPIF) of thin sheets of Aluminium AA3003-O and calamine brass Cu67Zn33 alloy. Accordingly, the parameters for processing, i.e., step depth, the feed rate of the tool, spindle speed, wall angle, thickness of metal sheets and type of material were selected as input and t...

متن کامل

An Ant Colony Optimization Algorithm for Network Vulnerability Analysis

Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...

متن کامل

The Minimum Universal Cost Flow in an Infeasible Flow Network

In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.

متن کامل

An Efficient Extension of Network Simplex Algorithm

In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...

متن کامل

Economic Load Dispatch using PSO Algorithm Based on Adaptive Learning Strategy Considering Valve point Effect

Abstract: In recent years due to problems such as population growth and as a result increase in demand for electrical energy, power systems have been faced with new challenges that not existed in the past. One of the most important issues in modern power systems is economic load dispatch, which is a complex optimization problem with a large number of variables and constraints. Due to the comple...

متن کامل

Conversion of Network Problem with Transfer Nodes, and Condition of Supplying the Demand of any Sink from the Particular Source to the Transportation Problem

In this article we present an algorithm for converting a network problem with several sources and several sinks including several transfer nodes and condition of supplying the demand of any sink from a particular source to the transportation problem.  Towards this end, and considering the very special structure of transportation algorithm, after implementing the shortest path algorithm or ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017